Bucket elimination for multiobjective optimization problems
نویسندگان
چکیده
منابع مشابه
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE), a well known dynamic programming generic algorithm, from mono-objective to multiobjective optimization. We show that the resulting algorithm, MO-BE, can be applied to true multi-objective problems as well as mono-obj...
متن کاملTabu Programming for Multiobjective Optimization Problems
In this paper, tabu programming for solving multiobjective optimization problems has been considered. Tabu search algorithm has been extended by using a computer program instead of a mathematical variable. For finding Paretooptimal solutions, the ranking procedure in the neighborhood of the current solutions has been applied. Moreover, the multiobjective optimization problem of task assignment ...
متن کاملConjugate duality for multiobjective composed optimization problems
Given a multiobjective optimization problem with the components of the objective function as well as the constraint functions being composed convex functions, we introduce, by using the Fenchel-Moreau conjugate of the functions involved, a suitable dual problem to it. Under a standard constraint qualification and some convexity as well as monotonicity conditions we prove the existence of strong...
متن کاملMini-bucket Elimination with Bucket Propagation
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly, approximation methods become the best option. Mini-bucket Elimination (MBE) is a well known approximation method for combinatorial optimization problems. It has a control parameter z that allow us to trade time and s...
متن کاملDifferential Evolution for Solving multiobjective Optimization Problems
The use of evolutionary strategies (ESs) to solve problems with multiple objectives (known as Vector Optimization Problems (VOPs)) has attracted much attention recently. Being population based approaches, ESs offer a means to find a set of Pareto-optimal solutions in a single run. Differential Evolution (DE) is an ES that was developed to handle optimization problems over continuous domains. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2006
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-006-6726-y